Average Competitive Learning Vector Quantization

نویسندگان

  • Luis A. Salomón
  • Jean-Claude Fort
  • Li-Vang Lozada-Chang
چکیده

We propose a new algorithm for vector quantization:Average Competitive Learning Vector Quantization(ACLVQ). It is a rather simple modification of the classical Competitive Learning Vector Quantization(CLVQ). This new formulation gives us similar results for the quantization error to those obtained by the CLVQ and reduce considerably the computation time to achieve the optimal quantizer. We establish the convergence of the method via the Kushner-Clark approach, and compare the two algorithms via the central limit Theorem. A simulation study is carried out showing the good performance of our proposal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An integrated approach to fuzzy learning vector quantization and fuzzy c-means clustering

This letter derives a new interpretation for a family of competitive learning algorithms and investigates their relationship to fuzzy c-means and fuzzy learning vector quantization. These algorithms map a set of feature vectors into a set of prototypes associated with a competitive network that performs unsupervised learning. Derivation of the new algorithms is accomplished by minimizing an ave...

متن کامل

Adaptive Vector Quantization with Deletion Method Based on Equinumber of Inputs in Partition Space

This paper presents an adaptive vector quantization with deletion method based on equinumber of inputs in partition space. Then we exhibit that partition errors are equivalent to each other when the numbers of inputs in partition space are mutually same, and describe that the average distortion is asymptotically minimized. We present an algorithm from the viewpoint of the equinumber principle a...

متن کامل

NGTSOM: A Novel Data Clustering Algorithm Based on Game Theoretic and Self- Organizing Map

Identifying clusters is an important aspect of data analysis. This paper proposes a noveldata clustering algorithm to increase the clustering accuracy. A novel game theoretic self-organizingmap (NGTSOM ) and neural gas (NG) are used in combination with Competitive Hebbian Learning(CHL) to improve the quality of the map and provide a better vector quantization (VQ) for clusteringdata. Different ...

متن کامل

Pursuit Reinforcement Competitive Learning: PRCL based Online Clustering with Learning Automata

A new online clustering method based on not only reinforcement and competitive learning but also pursuit algorithm (Pursuit Reinforcement Competitive Learning: PRCL) as well as learning automata is proposed for reaching a relatively stable clustering solution in comparatively short time duration. UCI repository data which are widely used for evaluation of clustering performance in usual is used...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Communications in Statistics - Simulation and Computation

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2014